Vertex-Weighted Hypergraph Learning for Multi-View Object Classification

نویسندگان

  • Lifan Su
  • Yue Gao
  • Xibin Zhao
  • Hai Wan
  • Ming Gu
  • Jia-Guang Sun
چکیده

3D object classification with multi-view representation has become very popular, thanks to the progress on computer techniques and graphic hardware, and attracted much research attention in recent years. Regarding this task, there are mainly two challenging issues, i.e., the complex correlation among multiple views and the possible imbalance data issue. In this work, we propose to employ the hypergraph structure to formulate the relationship among 3D objects, taking the advantage of hypergraph on high-order correlation modelling. However, traditional hypergraph learning method may suffer from the imbalance data issue. To this end, we propose a vertex-weighted hypergraph learning algorithm for multi-view 3D object classification, introducing an updated hypergraph structure. In our method, the correlation among different objects is formulated in a hypergraph structure and each object (vertex) is associated with a corresponding weight, weighting the importance of each sample in the learning process. The learning process is conducted on the vertex-weighted hypergraph and the estimated object relevance is employed for object classification. The proposed method has been evaluated on two public benchmarks, i.e., the NTU and the PSB datasets. Experimental results and comparison with the state-of-the-art methods and recent deep learning method demonstrate the effectiveness of our proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Classification Algorithm on Hypergraph

Classification learning problem on hypergraph is an extension of multi-label classification problem on normal graph, which divides vertices on hypergraph into several classes. In this paper, we focus on the semi-supervised learning framework, and give theoretic analysis for spectral based hypergraph vertex classification semi-supervised learning algorithm. The generalization bound for such algo...

متن کامل

Relational Learning with Hypergraphs

Relational learning has received extensive attentions in recent years since a huge amount of data is generated every day in the cyber-space andmost of them is organized by the relations between entities. Themain tasks of the relational learning include discovering the communities of entities, classifying the entities, and make predictions of possible new relations. Since the graph is a natural ...

متن کامل

Beyond Pairwise Classification and Clustering Using Hypergraphs

In many applications, relationships among objects of interest are more complex than pairwise. Simply approximating complex relationships as pairwise ones can lead to loss of information. An alternative for these applications is to analyze complex relationships among data directly, without the need to first represent the complex relationships into pairwise ones. A natural way to describe complex...

متن کامل

Weighted Transversals of a Hypergraph

We consider a generalization of the notion of transversal to a finite hypergraph, so called weighted transversals. Given a non-negative weight vector assigned to each hyperedge of the input hypergraph, we define a weighted transversal as a minimal vertex set which intersects a collection of hyperedges of sufficiently large total weight. We show that the hypergraph of all weighted transversals i...

متن کامل

Soft-Supervised Learning for Text Classification

We propose a new graph-based semisupervised learning (SSL) algorithm and demonstrate its application to document categorization. Each document is represented by a vertex within a weighted undirected graph and our proposed framework minimizes the weighted Kullback-Leibler divergence between distributions that encode the class membership probabilities of each vertex. The proposed objective is con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017